#include "kcore_influential_communitySearch.h"
using namespace std;
int n;
int query_k = 0, query_l = 0;
double eta;// Pr[deg[v]>=k] >= eta.

int main()
{
     /** 参数提前设定 **/

    n = 27097;//节点个数 the number of nodes 要预先设置一下。
    query_k = 1;
    query_l = 6;
    /** 读数据 **/
    string DBLP_DB_PATH = "C:/Users/pc/Desktop/homework/Dataset/DBLP/DB_27097_195996_Graph.csv";
    string DBLP_DB_PATH1 = "C:/Users/pc/Desktop/homework/Dataset/DBLP/DB_27097author_topic_distribution.csv";
    string DBLP_DM_PATH = "C:/Users/pc/Desktop/homework/Dataset/DBLP/DM_49831_319396_Graph.csv";
    string DBLP_DM_PATH1 = "C:/Users/pc/Desktop/homework/Dataset/DBLP/DM_49831author_topic_distribution.csv";
    
    string DBLP_Test_PATH = "C:/Users/pc/Desktop/homework/Dataset/DBLP/test.csv";

    bool directed = 0; // undirected

    read_dataset(DBLP_DB_PATH, directed);


    /** 获取每个点的贡献度 **/
    // get_weight_byMC();//任意点的权重，不应该相同，可以按照排序，赋值大小顺序
    get_weight(DBLP_DB_PATH1, n);

    int k, l;
    k = 10;// deg[v] >= k;

    // Kcore_Community_Search(k, n);//不考虑贡献度，只考虑拓扑

    Kcore_influential_Community_Search(k, n);

    // int r = 5;
    // top_r_Kcore_influential_Community_Search(k, n, r);

    // dataForGraph(k, n);

    return 0;
}